Low-Rank Approximations for Parametric Non-Symmetric Elliptic Problems
نویسندگان
چکیده
In this study, we obtained low-rank approximations for the solution of parametric non-symmetric elliptic partial differential equations. We proved existence optimal approximation subspaces that minimize error between and an on subspace, with respect to mean quadratic norm associated any preset in space solutions. Using a tensorized decomposition, built expansion approximating solutions summands finite-dimensional strong convergence truncated expansion. For rank-one approximations, similar PGD expansion, linear power iteration method compute modes series data small enough. presented some numerical results good agreement theoretical analysis.
منابع مشابه
Asymptotic Approximations for Symmetric Elliptic Integrals
Abstract. Symmetric elliptic integrals, which have been used as replacements for Legendre’s integrals in recent integral tables and computer codes, are homogeneous functions of three or four variables. When some of the variables are much larger than the others, asymptotic approximations with error bounds are presented. In most cases they are derived from a uniform approximation to the integrand...
متن کاملConvergence of MsFEM approximations for elliptic, non-periodic homogenization problems
In this work, we are concerned with the convergence of the multiscale finite element method (MsFEM) for elliptic homogenization problems, where we do not assume a certain periodic or stochastic structure, but an averaging assumption which in particular covers periodic and ergodic stochastic coefficients. We also give a result on the convergence in the case of an arbitrary coupling between grid ...
متن کاملAlmost optimal interior penalty discontinuous approximations of symmetric elliptic problems on non-matching grids
We consider an interior penalty discontinuous approximation for symmetric elliptic problems of second order on non–matching grids in this paer. The main result is an almost optimal error estimate for the interior penalty approximation of the original problem based on the partition of the domain into a finite number of subdomains. Further, an error analysis for the finite element approximation o...
متن کاملGeneralized Low-Rank Approximations
We study the frequent problem of approximating a target matrix with a matrix of lower rank. We provide a simple and efficient (EM) algorithm for solving weighted low rank approximation problems, which, unlike simple matrix factorization problems, do not admit a closed form solution in general. We analyze, in addition, the nature of locally optimal solutions that arise in this context, demonstra...
متن کاملWeighted Low-Rank Approximations
We study the common problem of approximating a target matrix with a matrix of lower rank. We provide a simple and efficient (EM) algorithm for solving weighted low-rank approximation problems, which, unlike their unweighted version, do not admit a closedform solution in general. We analyze, in addition, the nature of locally optimal solutions that arise in this context, demonstrate the utility ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Frontiers in Physics
سال: 2022
ISSN: ['2296-424X']
DOI: https://doi.org/10.3389/fphy.2022.869681